Semi-random Process Without Replacement

نویسندگان

چکیده

We introduce and study a semi-random multigraph process, which forms no-replacement variant of the process that was introduced in [3]. The starts with an empty graph on vertex set [n]. For every positive integers q \(1\le r\le n\), \(((q-1)n+r)\)th round decision-maker, called Builder, is offered \(\pi _q(r)\), where _1, \pi _2, \ldots \) sequence permutations \(S_n\), chosen independently uniformly at random. Builder then chooses additional (according to strategy his choice) connects it by edge _q(r)\).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Accelerating weighted random sampling without replacement

Random sampling from discrete populations is one of the basic primitives in statistical computing. This article briefly introduces weighted and unweighted sampling with and without replacement. The case of weighted sampling without replacement appears to be most difficult to implement efficiently, which might be one reason why the R implementation performs slowly for large problem sizes. This p...

متن کامل

Generating Antithetic Random Variates in Simulation of a Replacement Process by Rejection Method

When the times between renewals in a renewal process are not exponentially distributed, simulation can become a viable method of analysis. The renewal function is estimated through simulation for a renewal process simulation for a renewal process with gamma distributed renewal times and the shape parameter a > 1. Gamma random deviates will be generated by means of the so called Acceptance Rejec...

متن کامل

Semi-Random Interleaver Design Criteria

Christine Fragouli and Ri hard D. Wesel Ele tri al Engineering Department University of California, Los Angeles hristin ee.u la.edu, wesel ee.u la.edu Abstra t A spread interleaver [1℄ of length N is a semi-random interleaver based on the random sele tion without repla ement of N integers from 1 to N under a design onstraint. This paper extends the spread-interleaver design method to multiple e...

متن کامل

On Optimal Replacement under Semi - Markov Conditions

We study the following model for a system the state of which is continuously observed. The set of possible states is a finite set {0, . . . , L}, where larger values represent increased states of deterioration from the “new condition” represented by state 0, to the “totally inoperative condition” of state L. Whenever the system changes state a decision has to be made as to whether it is renovat...

متن کامل

Random Surfing Without Teleportation

In the standard Random Surfer Model, the teleportation matrix is necessary to ensure that the final PageRank vector is well-defined. The introduction of this matrix, however, results in serious problems and imposes fundamental limitations to the quality of the ranking vectors. In this work, building on the recently proposed NCDawareRank framework, we exploit the decomposition of the underlying ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Trends in mathematics

سال: 2021

ISSN: ['2297-024X', '2297-0215']

DOI: https://doi.org/10.1007/978-3-030-83823-2_21